ANALYSIS OF SUCCESSIVE CATEGORIES DATA USING MATHEMATICAL PROGRAMMING
نویسندگان
چکیده
منابع مشابه
automatic verification of authentication protocols using genetic programming
implicit and unobserved errors and vulnerabilities issues usually arise in cryptographic protocols and especially in authentication protocols. this may enable an attacker to make serious damages to the desired system, such as having the access to or changing secret documents, interfering in bank transactions, having access to users’ accounts, or may be having the control all over the syste...
15 صفحه اولanalysis of ruin probability for insurance companies using markov chain
در این پایان نامه نشان داده ایم که چگونه می توان مدل ریسک بیمه ای اسپیرر اندرسون را به کمک زنجیره های مارکوف تعریف کرد. سپس به کمک روش های آنالیز ماتریسی احتمال برشکستگی ، میزان مازاد در هنگام برشکستگی و میزان کسری بودجه در زمان وقوع برشکستگی را محاسبه کرده ایم. هدف ما در این پایان نامه بسیار محاسباتی و کاربردی تر از روش های است که در گذشته برای محاسبه این احتمال ارائه شده است. در ابتدا ما نشا...
15 صفحه اولMathematical Programming Approaches for the Analysis of Microarray Data
One of the major challenges facing the analysis of high-throughput microarray measurements is how to extract in a systematic and rigorous way the biologically relevant components from the experiments in order to establish meaningful connections linking genetic information to cellular function. Because of the significant amount of experimental information that is generated (expression levels of ...
متن کاملMathematical Programming for Missing Data
We propose a mathematical programming method to deal with uncertainty in the observations of a classification problem. This means that we can deal with situations where instead of a sample (xi, yi) we may only have a distribution over (xi, yi) at our disposition. In particular, we derive a robust formulation when the uncertainty is given by a normal distribution. This leads to Second Order Cone...
متن کاملScalable Analysis of Linear Systems Using Mathematical Programming
We present a method for generating linear invariants for large systems. The method performs forward propagation in an abstract domain consisting of arbitrary polyhedra of a predefined fixed shape. The basic operations on the domain like abstraction, intersection, join and inclusion tests are all posed as linear optimization queries, which can be solved efficiently by existing LP solvers. The nu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Operations Research Society of Japan
سال: 2007
ISSN: 1349-8940,2188-8280
DOI: 10.15807/torsj.50.68